Direction Maps for Cooperative Pathfinding
نویسندگان
چکیده
Cooperative behavior is a desired trait in many fields from computer games to robotics. Yet, achieving cooperative behavior is often difficult, as maintaining shared information about the dynamics of agents in the world can be complex. We focus on the specific task of cooperative pathfinding and introduce a new approach based on the idea of “direction maps” that learns about the movement of agents in the world. This learned data then is used to produce implicit cooperation between agents. This approach is less expensive and has better performance than several existing cooperative algorithms.
منابع مشابه
Finding Optimal Solutions to Cooperative Pathfinding Problems
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first practical, admissible, and complete algorithm for solving problems of this kind. First, we propose a technique called operator decomposition, which can be used to reduce the branching factors of many search algorithms...
متن کاملA new approach to cooperative pathfinding (Short Paper)
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map. Existing approaches to this problem include using static or dynamic information to help coordination. However, the resulting behaviour is not always desirable, in that too much information is hand-coded into the prob...
متن کاملCooperative Pathfinding
Cooperative Pathfinding is a multi-agent path planning problem where agents must find non-colliding routes to separate destinations, given full information about the routes of other agents. This paper presents three new algorithms for efficiently solving this problem, suitable for use in Real-Time Strategy games and other real-time environments. The algorithms are decoupled approaches that brea...
متن کاملPerformance Analysis of Pathfinding Algorithms Based on Map Distribution
The distribution information of game maps is highly relevant to the execution efficiency of path searching and the degree of game difficulty. This paper analyzes the relationship between the pathfinding performance and the obstacles distribution in maps from two aspects, pathfinding algorithm design and game’s map design respectively. A hierarchical pathfinding algorithm called CDHPA* is propos...
متن کاملThe JPS Pathfinding System
We describe a pathfinding system based on Jump Point Search (JPS): a recent and very successful search strategy that performs symmetry breaking to speed up optimal pathfinding on grid maps. We first modify JPS for grid maps where corner-cutting moves are not allowed. We then describe JPS+: a new derivative search strategy that reformulates an input graph into an equivalent symmetry-reduced form...
متن کامل